On the Newton and covering radii of linear codes
نویسندگان
چکیده
The Newton radius of a code is the largest weight of a uniquely correctable error. The covering radius is the largest distance between a vector and the code. Two relations between the Newton radius and the covering radius are given.
منابع مشابه
Relations between the covering and Newton radii of binary codes
The Newton radius of a code is the largest weight of a uniquely correctable error. The covering radius is the largest distance between a vector and the closest codeword. A couple of relations involving the Newton and covering radii are discussed. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملOn the least covering radius of binary linear codes of dimension 6
In this work a heuristic algorithm for obtaining lower bounds on the covering radius of a linear code is developed. Using this algorithm the least covering radii of the binary linear codes of dimension 6 are determined. Upper bounds for the least covering radii of binary linear codes of dimensions 8 and 9 are derived.
متن کاملOn the covering radii of extremal doubly even self-dual codes
In this note, we study the covering radii of extremal doubly even self-dual codes. We give slightly improved lower bounds on the covering radii of extremal doubly even self-dual codes of lengths 64, 80 and 96. The covering radii of some known extremal doubly even self-dual [64, 32, 12] codes are determined.
متن کاملMulti-Covering Radius for Rank Metric Codes
The results of this paper are concerned with the multi-covering radius, a generalization of covering radius, of Rank Distance (RD) codes. This leads to greater understanding of RD codes and their distance properties. Results on multi-covering radii of RD codes under various constructions are given by varying the parameters. Some bounds are established. A relationship between multi-covering radi...
متن کاملThe Multicovering Radii of Codes Preliminary Version
The covering radius of a code is the least r such that the set of balls of radius r around codewords covers the entire ambient space. We introduce a generalization of the notion of covering radius. The m-covering radius of a code is the least radius such that the set of balls of the radius covers all m-tuples of elements in the ambient space. We investigate basic properties of m-covering radii....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999